Workload balancing in identical parallel machine scheduling using a mathematical programming method
نویسندگان
چکیده
منابع مشابه
A Mathematical Model of a Multi-Criteria Parallel Machine Scheduling Problem: a Genetic Algorithm (RESEARCH NOTE)
.
متن کاملNon-Identical Parallel Machine Scheduling with Sequence and Machine Dependent Setup Times Using Meta-Heuristic Algorithms
This paper considers a non-identical parallel machine scheduling problem with sequence and machine dependent setup times. The objective of this problem is to determine the allocation of jobs and the scheduling of each machine to minimize makespan. A mathematical model for optimal solution is derived. An in-depth analysis of the model shows that it is very complicated and difficult to obtain opt...
متن کاملA Workload-aware Resources Scheduling Method for Virtual Machine
Virtualization-based cloud computing platforms allow multiple virtual machines (VMs) running on the same physical machine. Efficient allocation of limited underlying resources has been a key issue. In order to improve the CPU resources utilization, this paper presents a workload-aware CPU resources scheduling method (WARS). WARS uses the allocated credits and consumed credits to diagnose the CP...
متن کاملScatter Search Algorithms for Identical Parallel Machine Scheduling Problems
We address the Identical Parallel Machine Scheduling Problem, one of the most important basic problems in scheduling theory, and some generalizations of it arising from real world situations. We survey the current state of the art for the most performing meta-heuristic algorithms for this class of problems, with special emphasis on recent results obtained through Scatter Search. We present insi...
متن کاملTight bounds for the identical parallel machine scheduling problem
We address the problem of minimizing makespan on identical parallel machines. We propose new lower bounding strategies and heuristics for this fundamental scheduling problem. The lower bounds are based on the so-called lifting procedure. In addition, two optimization-based heuristics are proposed. These heuristics require iteratively solving a subset-sum problem. We present the results of compu...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: International Journal of Computational Intelligence Systems
سال: 2013
ISSN: 1875-6891,1875-6883
DOI: 10.1080/18756891.2013.853932